Relation between powers of factors and the recurrence function characterizing Sturmian words

نویسندگان

  • Zuzana Masáková
  • Edita Pelantová
چکیده

In this paper we put into relation the index of an infinite aperiodic word and its recurrence function. With the use of this relation, we then give a new characterization of Sturmian words. As a byproduct, we give a new proof of theorem of Damanik and Lenz describing the index of a Sturmian word in terms of the continued fraction expansion of its slope.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relation between powers of factors and recurrence function characterizing Sturmian words

In this paper we put into relation the index of an infinite aperiodic word and its recurrence function. With the use of this relation, we then give a new characterization of Sturmian words. As a byproduct, we give a new proof of theorem of Damanik and Lenz describing the index of a Sturmian word in terms of the continued fraction expansion of its slope.

متن کامل

Characterization of Repetitions in Sturmian Words: A New Proof

We present a new, dynamical way to study powers (or repetitions) in Sturmian words based on results from Diophantine approximation theory. As a result, we provide an alternative and shorter proof of a result by Damanik and Lenz characterizing powers in Sturmian words [Powers in Sturmian Sequences, European J. Combin. 24 (2003), 377–390]. Further, as a consequence, we obtain a previously known f...

متن کامل

On the Structure of Bispecial Sturmian Words I

A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, th...

متن کامل

On the Structure of Bispecial Sturmian Words

A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, th...

متن کامل

Standard Words and Abelian Powers in Sturmian Words

We give three descriptions of the factors of a Sturmian word that are standard words. We also show that all Sturmian words are so-called everywhere abelian krepetitive for all integers k ≥ 1, that is, all sufficiently long factors have an abelian kth power as a prefix. More precisely, given a Sturmian word t and an integer k, there exist two integers `1 and `2 such that each position in t has a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 410  شماره 

صفحات  -

تاریخ انتشار 2009